Small and Large MCTS Playouts Applied to Chinese Dark Chess Stochastic Game
نویسندگان
چکیده
Monte-Carlo tree search is a powerful paradigm for full information games. We present various changes applied to this algorithm to deal with the stochastic game Chinese Dark Chess. We experimented with group-nodes and chance-nodes using various configurations: with different playout policies, with different playout size, with true or evaluated wins. Results show that extending playout size over the real draw condition is beneficial to group-nodes and to chance-nodes. It also shows that using evaluation function can reduce the number of draw games with group-nodes and can be increased with chance-nodes.
منابع مشابه
Monte-Carlo Tree Reductions for Stochastic Games
Monte-Carlo Tree Search (MCTS) is a powerful paradigm for perfect information games. When considering stochastic games, the tree model that represents the game has to take chance and a huge branching factor into account. As effectiveness of MCTS may decrease in such a setting, tree reductions may be useful. Chance-nodes are a way to deal with random events. Move-groups are another way to deal e...
متن کاملPlayout Search for Monte-Carlo Tree Search in Multi-player Games
Monte-Carlo Tree Search (MCTS) has become a popular search technique for playing multi-player games over the past few years. In this paper we propose a technique called Playout Search. This enhancement allows the use of small searches in the playout phase of MCTS in order to improve the reliability of the playouts. We investigate max, Paranoid and BRS for Playout Search and analyze their perfor...
متن کاملAdapting Improved Upper Confidence Bounds for Monte-Carlo Tree Search
The UCT algorithm, which combines the UCB algorithm and Monte-Carlo Tree Search (MCTS), is currently the most widely used variant of MCTS. Recently, a number of investigations into applying other bandit algorithms to MCTS have produced interesting results. In this research, we will investigate the possibility of combining the improved UCB algorithm, proposed by Auer et al. [2], with MCTS. Howev...
متن کاملEnhancements for Monte-Carlo Tree Search in Ms Pac-Man
In this paper enhancements for the Monte-Carlo Tree Search (MCTS) framework are investigated to play Ms Pac-Man. MCTS is used to find an optimal path for an agent at each turn, determining the move to make based on randomised simulations. Ms Pac-Man is a real-time arcade game, in which the protagonist has several independent goals but no conclusive terminal state. Unlike games such as Chess or ...
متن کاملChinese Dark Chess
Chinese dark chess is a popular and easy-to-learn game in Asia. The characteristic of possible revealing of unknown pieces makes it different from Chinese chess or Western chess. Players with luck may win a game by chance. Thus, there is a probabilistic behavior that a player has to consider. Computer Chinese dark chess problems can be divided into three phases: 1) the opening game, 2) the midd...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014